Technical Note—Some Very Easy Knapsack/Partition Problems
نویسندگان
چکیده
منابع مشابه
Some Very Easy Knapsack / Partition Problems
Consider the problem of partitioning a group of b indistinguishable objects into subgroups, each of size at leastl and at most u. The objective is to minimize the additive separable cost of the partition, where the cost associated with a subgroup of size j is c(j). In the case that c(.) is convex, we show how to solve the problem in O(log u-/ + 1) steps. In the case that c(.) is concave, we sol...
متن کاملVery Large Cliques are Easy to Detect
It is known that, for every constant k ≥ 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit using much fewer than n gates. We show that, for every constant k, the presence of an (n − k)-clique in an n-vertex graph can be detected by a monotone circuit using only a logarithmic number of fanin-2 OR gates; the tot...
متن کاملEasy Problems are Sometimes Hard
We present a detailed experimental investigation of the easy-hard-easy phase transition for randomly generated instances of satisfiability problems. Problems in the hard part of the phase transition have been extensively used for benchmarking satisfiability algorithms. This study demonstrates that problem classes and regions of the phase transition previously thought to be easy can sometimes be...
متن کاملLung Transplantation: Technical Problems.
The biological problems involved in successful organ transplantation are well known and have been reviewed by Gowans (1962) and by Howard and Michie (1963). Besides these there are many technical difficulties. These may be studied experimentally by lung excision and re-implantation in the same animal, or by lung transplantation from unrelated or related animals. Further, the tolerance time of l...
متن کاملValued Constraint Satisfaction Problems: Hard and Easy Problems
In order to deal with over-constrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+;max : : :) to aggregate constraint violations. In this paper, we consider a simple algebraic framework, related to Partial Constraint Sa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1985
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.33.5.1154